In the classical Secret-Key generation model, Common Randomness is generatedby two terminals based on the observation of correlated components of a commonsource, while keeping it secret from a non-legitimate observer. It is assumedthat the statistics of the source are known to all participants. In this work,the Secret-Key generation based on a compound source is studied where therealization of the source statistic is unknown. The protocol should guaranteethe security and reliability of the generated Secret-Key, simultaneously forall possible realizations of the compound source. A single-letter lower-boundof the Secret-Key capacity for a finite compound source is derived as afunction of the public communication rate constraint. A multi-letter capacityformula is further computed for a finite compound source for the case in whichthe public communication is unconstrained. Finally a single-letter capacityformula is derived for a degraded compound source with an arbitrary set ofsource states and a finite set of marginal states.
展开▼
